Group Decision Diagram (GDD): A Compact Representation for Permutations
نویسندگان
چکیده
منابع مشابه
Data Representation and Efficient Solution: A Decision Diagram Approach
Decision diagrams are a family of data structures that can compactly encode many functions on discrete structured domains, that is, domains that are the cross-product of finite sets. We present some important classes of decision diagrams and show how they can be effectively employed to derive “symbolic” algorithms for the analysis of large discrete-state models. In particular, we discuss both e...
متن کاملCompact and Efficient Permutations for Proximity Searching
Proximity searching consists in retrieving the most similar objects to a given query. This kind of searching is a basic tool in many fields of artificial intelligence, because it can be used as a search engine to solve problems like kNN searching. A common technique to solve proximity queries is to use an index. In this paper, we show a variant of the permutation based index, which, in his orig...
متن کاملComputing a Hierarchical Static Order for Decision Diagram-Based Representation from P/T Nets
State space generation suffers from the typical combinatorial explosion problem when dealing with industrial specifications. In particular, memory consumption while storing the state space must be tackled to verify safety properties. Decision Diagrams are a way to tackle this problem. However, their performance strongly rely on the way variables encode a system. Another way to fight combinatori...
متن کاملOn the Diagram of Schröder Permutations
Egge and Mansour have recently studied permutations which avoid 1243 and 2143 regarding the occurrence of certain additional patterns. Some of the open questions related to their work can easily be answered by using permutation diagrams. As for 132-avoiding permutations the diagram approach gives insights into the structure of {1243, 2143}-avoiding permutations that yield simple proofs for some...
متن کاملOn the diagram of 132-avoiding permutations
The diagram of a 132-avoiding permutation can easily be characterized: it is simply the diagram of a partition. Based on this fact, we present a new bijection between 132-avoiding and 321-avoiding permutations. We will show that this bijection translates the correspondences between these permutations and Dyck paths given by Krattenthaler and by Billey-Jockusch-Stanley, respectively, to each oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33012986